package EnterpriseAlgorithm.LinkedList.Code.PrintShare;
class Solution {
    public void printCommonPart(Node head1, Node head2) {
        System.out.print("Common Part:\n");
        while (head1 != null && head2 != null) {
            if (head1.value < head2.value) {
                head1 = head1.next;
            } else if (head1.value > head2.value) {
                head2 = head2.next;
            } else {
                System.out.print(head1.value + "\t");
                head1 = head1.next;
                head2 = head2.next;
            }
        }
        System.out.println();
    }
}
